Circumspect descent prevails in solving random constraint satisfaction problems
نویسندگان
چکیده
منابع مشابه
Circumspect descent prevails in solving random constraint satisfaction problems
We study the performance of stochastic local search algorithms for random instances of the K-satisfiability (K-SAT) problem. We present a stochastic local search algorithm, ChainSAT, which moves in the energy landscape of a problem instance by never going upwards in energy. ChainSAT is a focused algorithm in the sense that it focuses on variables occurring in unsatisfied clauses. We show by ext...
متن کاملDqF Workshop Stochastic Differential Equations: Models and Numerics Circumspect descent prevails in solving random con- straint satisfaction problems
One aim of molecular dynamics simulations is to sample Boltzmann-Gibbs measures associated to some potentials in high dimensional spaces, to compute macroscopic quantities (such as chemical reaction constants, or diffusions constants) by statistical means in the canonical (NVT) ensemble. Numerical methods typically rely on ergodic limits for processes solution to well-chosen stochastic differen...
متن کاملRandom Constraint Satisfaction Problems
Random instances of constraint satisfaction problems such as k-SAT provide challenging benchmarks. If there are m constraints over n variables there is typically a large range of densities r = m/n where solutions are known to exist with probability close to one due to non-constructive arguments. However, no algorithms are known to find solutions efficiently with a non-vanishing probability at e...
متن کاملSolving quantified constraint satisfaction problems
We make a number of contributions to the study of the Quantified Constraint Satisfaction Problem (QCSP). The QCSP is an extension of the constraint satisfaction problem that can be used to model combinatorial problems containing contingency or uncertainty. It allows for universally quantified variables that can model uncertain actions and events, such as the unknown weather for a future party, ...
متن کاملA New Method for Solving Constraint Satisfaction Problems
Many important problems in Artificial Intelligence can be defined as Constraint Satisfaction Problems (CSP). These types of problems are defined by a limited set of variables, each having a limited domain and a number of Constraints on the values of those variables (these problems are also called Consistent Labeling Problems (CLP), in which “Labeling" means assigning a value to a variable.) Sol...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the National Academy of Sciences
سال: 2008
ISSN: 0027-8424,1091-6490
DOI: 10.1073/pnas.0712263105